Trade‐off between seed dispersal in space and time
نویسندگان
چکیده
منابع مشابه
Optimal Time-Space Tradeoff in Probabilistic Inference
Recursive Conditioning, RC, is an any-space algorithm lor exact inference in Bayesian networks, which can trade space for time in increments of the size of a floating point number. This smooth tradeoff' is possible by varying the algorithm's cache size. When RC is run with a constrained cache size, an important problem arises: Which specific results should be cached in order to minimize the run...
متن کاملVertebrate Dispersal of Seed Plants through Time
■ Abstract Vertebrate dispersal of fruits and seeds is a common feature of many modern angiosperms and gymnosperms, yet the evolution and frequency of this feature in the fossil record remain unclear. Increasingly complex information suggests that (a) plants had the necessary morphological features for vertebrate dispersal by the Pennsylvanian, but possibly in the absence of clear vertebrate di...
متن کاملBiomimetics on seed dispersal: survey and insights for space exploration.
Seeds provide the vital genetic link and dispersal agent between successive generations of plants. Without seed dispersal as a means of reproduction, many plants would quickly die out. Because plants lack any sort of mobility and remain in the same spot for their entire lives, they rely on seed dispersal to transport their offspring throughout the environment. This can be accomplished either co...
متن کاملTopological parameters for time-space tradeoff
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and deterministic networks as well as for accomplishing optimization tasks. By analyzing the problem structure the user can select from a spectrum of algorithms, the one that best meets a given time-space specification. T...
متن کاملA Time-Space Tradeoff for Element Distinctness
In a time-space tradeoff for sorting on non-oblivious machines, Borodin et. Al. [J. Comput. System Sci., 22(1981), pp. 351-364] proved that to sort $n$ elements requires $TS=\Omega(n^2)$ where $T=time$ and $S=space$ on a comparison based branching program. Although element distinctness and sorting are equivalent problems on a computation tree, the stated tradeoff result does not immediately fol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ecology Letters
سال: 2020
ISSN: 1461-023X,1461-0248
DOI: 10.1111/ele.13595